{"componentChunkName":"component---src-templates-post-jsx","path":"/[Programmers]60063/","result":{"data":{"site":{"siteMetadata":{"title":"SUbbb"}},"markdownRemark":{"id":"a746ab50-64fe-599b-849b-f882a49b299e","excerpt":"문제 Programmers - 블록 이동하기 📍 Logic BFS 방식으로  탐색하는 함수로, 총 3번의  문이 존재한다. 첫번째는 주어진 좌표로부터 이동 가능한 상하좌우 좌표를 queue에 추가 두번째와 세번재는 로봇의 좌표 중 하나를 기준으로 90도 회전하여 갈 수 있는 좌표를 queue에 추가 📄 CODE ✏️ Review BFS를 사용해 목적지까지 …","html":"<h2>문제</h2>\n<p><a href=\"https://programmers.co.kr/learn/courses/30/lessons/60063\">Programmers - 블록 이동하기</a></p>\n<h3>📍 <strong>Logic</strong></h3>\n<deckgo-highlight-code language=\"java\" terminal=\"carbon\" theme=\"a11y-dark\" line-numbers=\"true\"  >\n          <code slot=\"code\">private void moveRobot() {\n    ...\n}</code>\n        </deckgo-highlight-code>\n<ul>\n<li>\n<p>BFS 방식으로 <code class=\"language-text\">board</code> 탐색하는 함수로, 총 3번의 <code class=\"language-text\">for</code> 문이 존재한다.</p>\n<ul>\n<li>첫번째는 주어진 좌표로부터 이동 가능한 상하좌우 좌표를 queue에 추가</li>\n<li>두번째와 세번재는 로봇의 좌표 중 하나를 기준으로 90도 회전하여 갈 수 있는 좌표를 queue에 추가</li>\n</ul>\n</li>\n</ul>\n<h3>📄 <strong>CODE</strong></h3>\n<details>\n  <summary>코드 보기/접기💫</summary>\n    <div markdown=\"1\">\n<deckgo-highlight-code  terminal=\"carbon\" theme=\"a11y-dark\" line-numbers=\"true\"  >\n          <code slot=\"code\">import java.util.*;\n\nclass Robot {\n    int x1;\n    int y1;\n    int dir;\n    int cost;\n    \n    public Robot(int x1, int y1, int dir, int cost) {\n        this.x1 = x1;\n        this.y1 = y1;\n        this.dir = dir;\n        this.cost = cost;\n    }\n}\n\nclass Solution {\n    static int[][] board;\n    static int size;\n    static int answer = 0;\n    \n    public int solution(int[][] board) {\n        this.board = board;\n        this.size = board.length;\n        \n        moveRobot();\n            \n        return answer;\n    }\n    \n    private void moveRobot() {\n        int[] xRange = {0, 1, 0, -1};\n        int[] yRange = {1, 0, -1, 0};\n        // 회전 시에 사용할 범위 배열\n        int[] rxRange = {-1, 1, 1, -1};\n        int[] ryRange = {1, 1, -1, -1};\n        boolean[][][] visited = new boolean[size][size][4];\n        \n        // Queue에는 왼쪽 좌표만 추가\n        Queue&lt;Robot&gt; queue = new LinkedList&lt;&gt;();\n    \n        int x1, y1, x2, y2, dir, cost;\n        int nx1, ny1, nx2, ny2, ndir;\n        \n        queue.add(new Robot(0, 0, 0, 0));\n        visited[0][0][0] = true;\n        \n        while (!queue.isEmpty()) {\n            Robot robot = queue.poll();\n            x1 = robot.x1;\n            y1 = robot.y1;\n            dir = robot.dir;\n            cost = robot.cost;\n            x2 = x1 + xRange[dir];\n            y2 = y1 + yRange[dir];\n            \n            // 종료\n            if (isFinish(x1, y1) || isFinish(x2, y2)) {\n                answer = cost;\n                return;\n            }\n            \n            // 상하좌우로 로봇 이동\n            for (int r = 0; r &lt; 4; r++) {\n                nx1 = x1 + xRange[r];\n                ny1 = y1 + yRange[r];\n                nx2 = x2 + xRange[r];\n                ny2 = y2 + yRange[r];\n                \n                if (!checkBoundary(nx1, ny1) || !checkBoundary(nx2, ny2)) continue;\n                if (board[nx1][ny1] == 1 || board[nx2][ny2] == 1) continue;\n                if (visited[nx1][ny1][dir]) continue;\n                \n                visited[nx1][ny1][dir] = true;\n                \n                queue.add(new Robot(nx1, ny1, dir, cost + 1));\n            }\n            \n            int rx, ry, tempDir;\n            \n            // x1, y1를 기준으로 90도 회전\n            // ndir은 0(오른쪽 대각선 위), 1(오른쪽 대각선 아래), 2(왼쪽 대각선 아래), 3(왼쪽 대각선 위) 중 하나\n            for (int i = 1; i &lt; 4; i += 2) { \n                ndir = computeDir(dir, i);\n                nx2 = x1 + xRange[ndir];\n                ny2 = y1 + yRange[ndir];\n\n                tempDir = (i == 1) ? ndir : dir;\n                rx = x1 + rxRange[tempDir];\n                ry = y1 + ryRange[tempDir];\n\n                if (!checkBoundary(nx2, ny2) || !checkBoundary(rx, ry)) continue;\n                if (board[nx2][ny2] == 1 || board[rx][ry] == 1) continue;\n                if (visited[x1][y1][ndir]) continue;\n\n                visited[x1][y1][ndir] = true;\n                \n                queue.add(new Robot(x1, y1, ndir, cost + 1));\n            }\n            \n            // 반대 방향 처리\n            // x2, y2를 기준으로 90도 회전\n            dir = computeDir(dir, 2);\n            for (int i = 1; i &lt; 4; i += 2) { \n                ndir = computeDir(dir, i);\n                nx1 = x2 + xRange[ndir];\n                ny1 = y2 + yRange[ndir];\n\n                tempDir = (i == 1) ? ndir : dir;\n                rx = x2 + rxRange[tempDir];\n                ry = y2 + ryRange[tempDir];\n\n                ndir = (ndir + 2) % 4;\n                if (!checkBoundary(nx1, ny1) || !checkBoundary(rx, ry)) continue;\n                if (board[nx1][ny1] == 1 || board[rx][ry] == 1) continue;\n                if (visited[nx1][ny1][ndir]) continue;\n\n                visited[nx1][ny1][ndir] = true;\n                \n                queue.add(new Robot(nx1, ny1, ndir, cost + 1));\n            }\n        }\n    }\n    \n    private boolean checkBoundary(int x, int y) {\n        return x &gt;= 0 &amp;&amp; x &lt; size &amp;&amp; y &gt;= 0 &amp;&amp; y &lt; size;\n    }\n    \n    private boolean isFinish(int x, int y) {\n        return x == size - 1 &amp;&amp; y == size - 1;\n    }\n    \n    private int computeDir(int dir, int i) {\n        return (dir + i) % 4;\n    }\n}</code>\n        </deckgo-highlight-code>\n  \t</div>\n</details>\n<h3>✏️ <strong>Review</strong></h3>\n<ul>\n<li>BFS를 사용해 목적지까지 최소 비용을 구하는 문제라 판단했다. 그래프 탐색 시에는 DFS, BFS가 가능한데, BFS가 최소 거리를 구하는데 더 효율적인 알고리즘이라는 것을 배웠던 기억이 나 BFS를 사용했다.</li>\n<li>아이디어 자체는 쉽게 떠올렸다만, 로봇의 좌표가 2개인 점과 이에 대한 회전 구현에 있어 어려웠다 ..</li>\n</ul>","frontmatter":{"title":"👩‍💻 60063. 블록 이동하기","date":"June 26, 2022","update":"June 26, 2022","tags":["BFS","구현"],"series":"👩‍💻 Programmers"},"fields":{"slug":"/[Programmers]60063/","readingTime":{"minutes":4.05}}},"seriesList":{"edges":[{"node":{"id":"6f6804dc-22a3-5271-be8a-786a5934477b","fields":{"slug":"/[Programmers]43165/"},"frontmatter":{"title":"👩‍💻 43165. 타겟 넘버"}}},{"node":{"id":"232c28d2-61a4-56f8-9581-3465ad02e40c","fields":{"slug":"/[Programmers]43163/"},"frontmatter":{"title":"👩‍💻 43163. 단어 변환"}}},{"node":{"id":"ece2da6a-d050-56e4-bc01-67c20b6303db","fields":{"slug":"/[Programmers]42578/"},"frontmatter":{"title":"👩‍💻 42578. 위장"}}},{"node":{"id":"1015b073-232e-5ef3-a92e-d7885980d13d","fields":{"slug":"/[Programmers]42576/"},"frontmatter":{"title":"👩‍💻 42576. 완주하지 못한 선수"}}},{"node":{"id":"c792304d-271c-563d-89d3-86aee9344483","fields":{"slug":"/[Programmers]42746/"},"frontmatter":{"title":"👩‍💻 42746. 가장 큰 수"}}},{"node":{"id":"a7de799b-48c6-5eab-8247-048f7d921606","fields":{"slug":"/[Programmers]42747/"},"frontmatter":{"title":"👩‍💻 42747. H-Index"}}},{"node":{"id":"0a0539b6-8b1d-5229-b683-a11c7cb6b831","fields":{"slug":"/[Programmers]42840/"},"frontmatter":{"title":"👩‍💻 42840. 모의고사"}}},{"node":{"id":"9da2693a-dfe4-59c6-9388-f61498de5717","fields":{"slug":"/[Programmers]42862/"},"frontmatter":{"title":"👩‍💻 42862. 체육복"}}},{"node":{"id":"33a54365-0a97-5b0f-bb98-2c9cd3bd01e6","fields":{"slug":"/[Programmers]67256/"},"frontmatter":{"title":"👩‍💻 67256. 키패드 누르기"}}},{"node":{"id":"9f46f287-12d4-51d7-b66b-87c6a34e02cc","fields":{"slug":"/[Programmers]67257/"},"frontmatter":{"title":"👩‍💻 67257. 수식 최대화"}}},{"node":{"id":"59cbf058-a1a4-5c2f-adf4-782ac9a6f221","fields":{"slug":"/[Programmers]67258/"},"frontmatter":{"title":"👩‍💻 67258. 보석 쇼핑"}}},{"node":{"id":"e6c5ace6-65ed-5d8c-9276-240d96b2ba18","fields":{"slug":"/[Programmers]67260/"},"frontmatter":{"title":"👩‍💻 67260. 동굴 탐험"}}},{"node":{"id":"c39f09d1-8f8b-5528-b1b7-b00095d62f70","fields":{"slug":"/[Programmers]67259/"},"frontmatter":{"title":"👩‍💻 67259. 경주로 건설"}}},{"node":{"id":"2b870527-5e4c-55af-a574-4d9a68167098","fields":{"slug":"/[Programmers]81302/"},"frontmatter":{"title":"👩‍💻 81302. 거리두기 확인하기"}}},{"node":{"id":"d9074b34-ffc6-5b1f-8668-55f64eb5da9f","fields":{"slug":"/[Programmers]81303/"},"frontmatter":{"title":"👩‍💻 81303. 표 편집"}}},{"node":{"id":"2a8ccd4c-16aa-5788-af89-89b338e8cc9d","fields":{"slug":"/[Programmers]81304/"},"frontmatter":{"title":"👩‍💻 81304. 미로 탈출"}}},{"node":{"id":"04791ec0-62b9-5927-879a-1f0bc5e9fded","fields":{"slug":"/[Programmers]81305/"},"frontmatter":{"title":"👩‍💻 81305. 시험장 나누기"}}},{"node":{"id":"0e5554d3-af02-5a2e-a7cc-df161a1f9258","fields":{"slug":"/[Programmers]64062/"},"frontmatter":{"title":"👩‍💻 64062. 징검다리 건너기"}}},{"node":{"id":"2ace2de6-3978-53ba-97c8-992a0a95ee4a","fields":{"slug":"/[Programmers]64064/"},"frontmatter":{"title":"👩‍💻 64064. 불량 사용자"}}},{"node":{"id":"6e98b4bf-8b00-55b8-896a-c4a7ea216c4e","fields":{"slug":"/[Programmers]64063/"},"frontmatter":{"title":"👩‍💻 64063. 호텔 방 배정"}}},{"node":{"id":"ecfcd17b-21d3-5f12-9e68-ed15d648c1bd","fields":{"slug":"/[Programmers]17680/"},"frontmatter":{"title":"👩‍💻 17680. 캐시"}}},{"node":{"id":"567fc5cf-5a51-5a77-bca1-3389363256bc","fields":{"slug":"/[Programmers]17677/"},"frontmatter":{"title":"👩‍💻 17677. 뉴스 클러스터링"}}},{"node":{"id":"3a56fa21-2504-54dd-a1f3-9990d0d6d598","fields":{"slug":"/[Programmers]17676/"},"frontmatter":{"title":"👩‍💻 17676. 추석 트래픽"}}},{"node":{"id":"d66adc03-6942-5480-bd44-3debea60ffba","fields":{"slug":"/[Programmers]17678/"},"frontmatter":{"title":"👩‍💻 17678. 셔틀버스"}}},{"node":{"id":"bd175d9e-2352-5f9f-9611-2af5a1ae82f4","fields":{"slug":"/[Programmers]17679/"},"frontmatter":{"title":"👩‍💻 17679. 프렌즈4블록"}}},{"node":{"id":"a3b26ae5-bd12-5412-b428-73dcdf98a075","fields":{"slug":"/[Programmers]17683/"},"frontmatter":{"title":"👩‍💻 17683. 방금그곡"}}},{"node":{"id":"455b88fc-837a-51fe-8cfe-89ebf8a31d5e","fields":{"slug":"/[Programmers]17684/"},"frontmatter":{"title":"👩‍💻 17684. 압축"}}},{"node":{"id":"70dd5a97-abc2-56d4-89c7-71418d1114a8","fields":{"slug":"/[Programmers]17686/"},"frontmatter":{"title":"👩‍💻 17686. 파일명 정렬"}}},{"node":{"id":"3b0d4d93-fc81-571d-9dc0-2a5ee69ce67b","fields":{"slug":"/[Programmers]17687/"},"frontmatter":{"title":"👩‍💻 17687. n진수 게임"}}},{"node":{"id":"80b89715-56df-5218-ba61-abbd1b74ce83","fields":{"slug":"/[Programmers]17685/"},"frontmatter":{"title":"👩‍💻 17685. 자동완성"}}},{"node":{"id":"e7b230d7-7af6-5bc4-9d3a-a9ef47bf9eb2","fields":{"slug":"/[Programmers]42892/"},"frontmatter":{"title":"👩‍💻 42892. 길 찾기 게임"}}},{"node":{"id":"73acf869-14e2-5957-8db6-63dc351e3029","fields":{"slug":"/[Programmers]42890/"},"frontmatter":{"title":"👩‍💻 42890. 후보키"}}},{"node":{"id":"f2b1d2a0-d730-5a9f-ac90-cd7df2b60e88","fields":{"slug":"/[Programmers]42891/"},"frontmatter":{"title":"👩‍💻 42891. 무지의 먹방 라이브"}}},{"node":{"id":"16b420bc-ccd5-58ed-b44c-879702c19fe6","fields":{"slug":"/[Programmers]42893/"},"frontmatter":{"title":"👩‍💻 42893. 매칭 점수"}}},{"node":{"id":"3ff09eb7-cb23-5a70-a3c9-9b3735ea28fb","fields":{"slug":"/[Programmers]42894/"},"frontmatter":{"title":"👩‍💻 42894. 블록 게임"}}},{"node":{"id":"f82052ca-f5ff-552d-89ce-01595a508880","fields":{"slug":"/[Programmers]42889/"},"frontmatter":{"title":"👩‍💻 42889. 실패율"}}},{"node":{"id":"a3e8c59e-211d-58fe-9410-a6370077027d","fields":{"slug":"/[Programmers]42888/"},"frontmatter":{"title":"👩‍💻 42888. 오픈채팅방"}}},{"node":{"id":"bad63d37-32fd-597d-8915-7661518e06f4","fields":{"slug":"/[Programmers]60057/"},"frontmatter":{"title":"👩‍💻 60057. 문자열 압축"}}},{"node":{"id":"9b85f70a-0b56-526f-8cda-2b095a7158ba","fields":{"slug":"/[Programmers]60058/"},"frontmatter":{"title":"👩‍💻 60058. 괄호 변환"}}},{"node":{"id":"b1cd1d23-4a65-5294-a3be-1131dda0f6bf","fields":{"slug":"/[Programmers]60059/"},"frontmatter":{"title":"👩‍💻 60059. 자물쇠와 열쇠"}}},{"node":{"id":"77497fd2-1f92-556f-af47-767ab7141fa6","fields":{"slug":"/[Programmers]60061/"},"frontmatter":{"title":"👩‍💻 60061. 기둥과 보 설치"}}},{"node":{"id":"62f4051d-0323-5081-abbd-314b4c5da910","fields":{"slug":"/[Programmers]60060/"},"frontmatter":{"title":"👩‍💻 60060. 가사 검색"}}},{"node":{"id":"ffd3312d-814a-5df8-80c3-4abba595c215","fields":{"slug":"/[Programmers]60062/"},"frontmatter":{"title":"👩‍💻 60062. 외벽 점검"}}},{"node":{"id":"a746ab50-64fe-599b-849b-f882a49b299e","fields":{"slug":"/[Programmers]60063/"},"frontmatter":{"title":"👩‍💻 60063. 블록 이동하기"}}},{"node":{"id":"427934c8-6ebd-54d6-b37b-7daacb2bec08","fields":{"slug":"/[Programmers]72410/"},"frontmatter":{"title":"👩‍💻 72410. 신규 아이디 추천"}}},{"node":{"id":"0ee5a9ec-27d2-591d-8792-51ef76cf4b8a","fields":{"slug":"/[Programmers]72411/"},"frontmatter":{"title":"👩‍💻 72411. 메뉴 리뉴얼"}}},{"node":{"id":"ccd2862d-b2cb-5aee-b6c2-1469674c75e4","fields":{"slug":"/[Programmers]72412/"},"frontmatter":{"title":"👩‍💻 72412. 순위 검색"}}},{"node":{"id":"2349b7a7-bc63-5fa9-82e6-bdc7efaf5050","fields":{"slug":"/[Programmers]72413/"},"frontmatter":{"title":"👩‍💻 72413. 합승 택시 요금"}}},{"node":{"id":"2634a55a-3a7a-5b8e-9318-bc822aa343b1","fields":{"slug":"/[Programmers]77485/"},"frontmatter":{"title":"👩‍💻 77485. 행렬 테두리 회전하기"}}},{"node":{"id":"b598ea73-64b3-57e6-983c-679e3717631f","fields":{"slug":"/[Programmers]77484/"},"frontmatter":{"title":"👩‍💻 77484. 로또의 최고 순위와 최저 순위"}}},{"node":{"id":"fcafa09c-a4d3-5615-b263-fe1fc20fd790","fields":{"slug":"/[Programmers]72414/"},"frontmatter":{"title":"👩‍💻 72414. 광고 삽입"}}},{"node":{"id":"0c8a23be-d97c-54fc-8127-aba17445e971","fields":{"slug":"/[Programmers]92334/"},"frontmatter":{"title":"👩‍💻 92334. 신고 결과 받기"}}},{"node":{"id":"9586e9b5-e987-54cb-9230-e1764af4ce78","fields":{"slug":"/[Programmers]92341/"},"frontmatter":{"title":"👩‍💻 92341. 주차 요금 계산"}}},{"node":{"id":"6aca0b79-bd54-5ec3-ab84-24977879e1d4","fields":{"slug":"/[Programmers]72415/"},"frontmatter":{"title":"👩‍💻 72415. 카드 짝 맞추기"}}},{"node":{"id":"18bcf67d-b2f7-51e4-814c-837cce31fea3","fields":{"slug":"/[Programmers]92335/"},"frontmatter":{"title":"👩‍💻 92335. k진수에서 소수 개수 구하기"}}},{"node":{"id":"5603b730-ccff-5724-bfb0-e2f79b6709b2","fields":{"slug":"/[Programmers]72416/"},"frontmatter":{"title":"👩‍💻 72416. 매출 하락 최소화"}}},{"node":{"id":"829f5cc8-ad4e-50be-8cbb-b006e6bfc166","fields":{"slug":"/[Programmers]92342/"},"frontmatter":{"title":"👩‍💻 92342. 양궁대회"}}},{"node":{"id":"79075744-a0cd-5502-b00c-3af12c23cac8","fields":{"slug":"/[Programmers]92343/"},"frontmatter":{"title":"👩‍💻 92343. 양과 늑대"}}},{"node":{"id":"76d961dd-a49d-5f21-931a-d966bf0e05fc","fields":{"slug":"/[Programmers]92344/"},"frontmatter":{"title":"👩‍💻 92344. 파괴되지 않은 건물"}}},{"node":{"id":"26d942fe-853c-5454-a43a-5c8dcac0202e","fields":{"slug":"/[Programmers]92345/"},"frontmatter":{"title":"👩‍💻 92345. 사라지는 발판"}}},{"node":{"id":"28aa974d-ca13-5c3f-adf9-f6be15b6b185","fields":{"slug":"/[Programmers]12899/"},"frontmatter":{"title":"👩‍💻 12899. 124 나라의 숫자"}}},{"node":{"id":"6789ecdd-02a7-51b4-a455-8e903a1cf060","fields":{"slug":"/[Programmers]12973/"},"frontmatter":{"title":"👩‍💻 12973. 짝지어 제거하기"}}},{"node":{"id":"b51b1653-15b4-52e7-8fc2-71f24a7aa3e8","fields":{"slug":"/[Programmers]77486/"},"frontmatter":{"title":"👩‍💻 77486. 다단계 칫솔 판매"}}},{"node":{"id":"47c3f84f-0127-5193-97eb-d9710556be4c","fields":{"slug":"/[Programmers]86053/"},"frontmatter":{"title":"👩‍💻 86053. 금과 은 운반하기"}}},{"node":{"id":"3b40becc-c51f-50d7-83fb-2c156af8669d","fields":{"slug":"/[Programmers]62050/"},"frontmatter":{"title":"👩‍💻 62050. 지형 이동"}}},{"node":{"id":"5e60c916-eb21-5bb0-835f-e00cd716a43f","fields":{"slug":"/[Programmers]76503/"},"frontmatter":{"title":"👩‍💻 76503. 모두 0으로 만들기"}}},{"node":{"id":"914f04f2-2d74-5852-af0e-c1f9e1d6deef","fields":{"slug":"/[Programmers]86052/"},"frontmatter":{"title":"👩‍💻 86052. 빛의 경로 사이클"}}},{"node":{"id":"847757f6-77cb-5170-b853-9010c97eda32","fields":{"slug":"/[Programmers]77886/"},"frontmatter":{"title":"👩‍💻 77886. 110 옮기기"}}},{"node":{"id":"3116f357-38df-5d49-8c58-74e4053cb729","fields":{"slug":"/[Programmers]49995/"},"frontmatter":{"title":"👩‍💻 49995. 쿠키 구입"}}},{"node":{"id":"c2f0fad3-5d0a-574c-a62b-1a30bf420179","fields":{"slug":"/[Programmers]12985/"},"frontmatter":{"title":"👩‍💻 12985. 예상 대진표"}}},{"node":{"id":"14d715d8-4b5d-5b54-8dbd-aa9ea800964a","fields":{"slug":"/[Programmers]76502/"},"frontmatter":{"title":"👩‍💻 76502. 괄호 회전하기"}}},{"node":{"id":"0e06eb59-75b1-58cb-94c4-ce0f324e6b01","fields":{"slug":"/[Programmers]87694/"},"frontmatter":{"title":"👩‍💻 87694. 아이템 줍기"}}},{"node":{"id":"42e3c5b5-ddcc-55e2-abee-8cce4be0df37","fields":{"slug":"/[Programmers]87391/"},"frontmatter":{"title":"👩‍💻 87391. 공 이동 시뮬레이션"}}}]},"previous":{"fields":{"slug":"/[Programmers]60062/"},"frontmatter":{"title":"👩‍💻 60062. 외벽 점검"}},"next":{"fields":{"slug":"/[읽을거리]Jackson의확장구조/"},"frontmatter":{"title":"📰 [Naver D2] Jackson의 확장 구조를 파헤쳐 보자"}}},"pageContext":{"id":"a746ab50-64fe-599b-849b-f882a49b299e","series":"👩‍💻 Programmers","previousPostId":"ffd3312d-814a-5df8-80c3-4abba595c215","nextPostId":"ef31a8e5-2be1-54f8-804e-7672524fa784"}},"staticQueryHashes":[]}